Unreliable Channels Are Easier to Verify Than Perfect Channels
نویسندگان
چکیده
منابع مشابه
Ring Networks Are Easier to Verify ? (report)
We show in this paper how the ring topology makes easier the analysis of communicating nite state machines' reachability set. We prove that the analysis of this kind of systems can be reduced to the analysis of a single automaton with a single queue. This leads us, by the use of new symbolic transitions, to the proposal of two semi-algorithms, one for normal ring networks and one for lossy ring...
متن کاملVerifying Programs with Unreliable Channels
We consider the verification of a particular class of infinite-state systems, namely systems consisting of finite-state processes that communicate via unbounded lossy FIFO channels. This class is able to model, e.g., link protocols such as the Alternating Bit Protocol and HDLC. For this class of systems, we show that several interesting verification problems are decidable by giving algorithms f...
متن کاملATP-sensitive Potassium Channels and L-type Calcium Channels are Involved in Morphine-induced Hyperalgesia after Nociceptive Sensitization in Mice
Introduction: We investigated the role of ATP-sensitive potassium channels and L-type calcium channels in morphine-induced hyperalgesia after nociceptive sensitization. Methods: We used a hotplate apparatus to assess pain behavior in male NMRI mice. Nociceptive sensitization was induced by three days injection of morphine and five days of drug free. On day 9 of the schedule, pain behavior te...
متن کاملDistributed computation on unreliable radio channels
An important topic in wireless networking is the development of reliable algorithms for environments suffering from adversarial interference. This term captures any type of channel disruption outside the control of the algorithm designer—from contention with unrelated devices to malicious jamming. In this thesis, we provide four contributions toward a comprehensive theoretical treatment of this...
متن کاملMultiple Distributed Checkpoints over Unreliable Channels
Failure recovery in a computing system can be based on periodically saving system state in a checkpoint. The problem of making a consistent checkpoint in a distributed system has previously been solved for the case in which communication links are error-free and deliver messages in the order in which they are sent. We present a solution that does not require links to preserve message order. Mes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0003